The Development of Simulated Annealing Algorithm for Hybrid Flow Shop Scheduling Problem to Minimize Makespan and Total Tardiness

Hybrid Flowshop Scheduling (HFS) is one of the most comprehensively studied in scheduling problems. HFS has m-machines in each stage so that it is more complicated that regular flowshop scheduling. There are several production systems using HFS, such as steel manufacture, textile, and paper industry [8] [15]. Makespan and total tardiness are two important goals in scheduling to make the scheduling more efficient and to fulfill customer demands. HFS is also NP Hard problems, because the bigger problem will need more time for computation to solve the problem. This research offers simulated annealing algorithm to solve this problem to get minimum makespan and total tardiness. Simulated annealing had used for scheduling problems before and this algorithms gives the good performance. Simulated annealing has the strength to get out of local optima by receiving the worse solution. In this research, this algorithm will be modified by increasing the temperature once when temperature had reached very small value. From the experiment done, modified simulated annealing gives the better performance than regular simulated annealing, especially in the bigger problem.